Kevin Compton , Jean - Eric Pin , Wolfgang Thomas ( editors ) : Automata Theory : Infinite Computations
نویسنده
چکیده
s of Talks Page I. Automata and Infinite Sequences 6 Ch. Frougny (Paris): Rational 0)-Relations, Application to the Representation of Real Numbers J. Karhuméiki (Turku): Finite Automata Computing Real Functions N. Klarlund (Aarhus): Progress Measures for Complementation of to-Automata B. Le Saec (Bordeaux): A Syntactic Approach to Deterministic to-Automata D. Perrin (Paris): to-Automata with Multiplicities R.R. Redziejowski (Lidingö): Adding In nite Product to a Semigroup L. Staiger (Siegen): Recursive Automata on In nite Words and the Veri cation of Concurrent Programs Th. Wilke (Kiel): Locally Threshold Testable to-languages and FGHG5-Sets II. Automata on In nite Traces 10 A. Petit (Paris): Automata for In nite Traces P. Gastin (Paris): Biichi Asynchronous Cellular Automata V. Diekert (Stuttgart): Somc Open Problems on Deterministic Trace Automata III. Tree Languages, Tree Automata, and In nite Games 12 E.A. Emerson (Austin): Complexity of Logics of Programs and Automata on In nite Objects A.W. Mostowski (Gdansk): Games with Forbidden Positions D. Niwinski (Warsaw): Problems in p-Calculus P.E. Schupp (Urbana): Simulating Altemating Automata by Nondeterministic Automata J. Skurczynski (Gdansk): Automata on In nite Trees with Weak Acceptance Conditions S. Zeitrnan (Detroit): Unforgettable Forgetful Detenninacy IV. Logical Aspects ' 15 K. Compton (Ann Arbor and Roquencourt): A Monadic Second-Order Limit Law for Unary Function P383 B. Courcelle (Bordeaux): Monadic Second-Order Definability Properties of In nite Graphs G. Sénizergues (Bordeaux): De nability in Weak Second-Order Logic of Some In nite Graphs A.L. Semenov and An. A. Muchnik (Moscow): Automata on In nite Objects, Monadic Theories, and Complexity H. Straubing (Boston): Circuit Complexity, Finite Automata and Generalized First-Order Logic V. Combinatorial Aspects 18 D. Beauquier (Paris): Games with Dominoes C. Choffrut (Paris): Some Questions on Sequential Bijections Between Free Monoids T. Head (Binghamton): Splicing Schemes and DNA I. AUTOMATA AND INFINITE SEQUENCES Rational 0)-Relations. Application to the Representation of Real numbers
منابع مشابه
Logic on Words
Quisani: Hello, I think we met before? Author: Yes, I visited Kevin Compton and Yuri Gurevich some time ago in Ann Arbor. Q: I remember it. You are not a logician, aren’t you? A: No, but I would like to talk with you about questions of logic related to the theory of finite automata. Q: I already read a column by Kevin Compton and Howard Straubing on a similar topic [13]. Are you too interested ...
متن کامل10501 Executive Summary - Advances and Applications of Automata on Words and Trees
The aim of the seminar was to discuss and systematize the recent fast progress in automata theory and to identify important directions for future research. For this, the seminar brought together more than 40 researchers from automata theory and related fields of applications. We had 19 talks of 30 minutes and 5 one-hour lectures leaving ample room for discussions. In the following we describe t...
متن کاملAutomata Theory and Infinite Transition Systems ∗
These lecture notes report on the use of automata theory in the study of infinite transition systems. This application of automata is an important ingredient of the current development of “infinite-state system verification”, and it provides an introduction into the field of “algorithmic model theory”, a study of infinite models with an emphasis on computability results.
متن کاملAutomata and semigroups recognizing infinite words
This paper is a survey on the algebraic approach to the theory of automata accepting infinite words. We discuss the various acceptance modes (Büchi automata, Muller automata, transition automata, weak recognition by a finite semigroup, ω-semigroups) and prove their equivalence. We also give two algebraic proofs of McNaughton’s theorem on the equivalence between Büchi and Muller automata. Finall...
متن کاملChurch's Problem and a Tour through Automata Theory
Church’s Problem, stated fifty years ago, asks for a finitestate machine that realizes the transformation of an infinite sequence α into an infinite sequence β such that a requirement on (α, β), expressed in monadic second-order logic, is satisfied. We explain how three fundamental techniques of automata theory play together in a solution of Church’s Problem: Determinization (starting from the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012